A Location Routing Problem with Time Windows Consideration: A Metaheuristics Approach

A substantial distribution system is achievable to attain through the simultaneous design of location facility and route generation. This problem generally called a routing (LRP), where both strategic decision operational decisions are considered during initial phase. Nevertheless, for some real applications, consideration time restriction due several reasons should be included in model. Some examples include perishable goods, company’s objective towards high level customer service, or emergency/disaster situations. Consequently, this research incorporates (LRP) with window constraints, including working hour also each customer. The windows (LRPTW) could not solved easily, especially large-sized one which an NP-hard problem. In its large solution pools, paper suggests integration variable neighborhood search (VNS) path relinking (PR) solve LRPTW. method first applied LRP benchmark validate effectiveness robustness proposed method. Computational results clarify that VNSPR can achieve best most competitive solutions when compared existing approaches. Further, we developed LRPTW instances from found datasets. able yield nearly optimal instances.